Combining Theorem Proving and ContinuousModels in Synchronous
نویسنده
چکیده
Support for system speciication in terms of modelling and simulation environments has become a common practice in safety-critical applications. Also, a current trend is the automatic code-generation, and integration with formal methods tools in terms of translators from a high level design { often using common intermediate languages. What is missing from current formal methods tools is a well-founded integration of models for diierent parts of a system, being software/hardware or control-intensive/data-intensive. By hardware we mean here the full range of domains in engineering systems including mechanics, hydraulics, electronics. Thus, there is a methodological gap for proving system properties from semantically well-deened descriptions of the parts. We report on the progress achieved with the European SYRF project with regard to veriication of integrated analog/discrete systems. The project pursues the development of new theories, application to case studies, and tool development in parallel. We use a ventilation control system, a case study provided by Saab Aerospace, to illustrate the work in progress on how hardware and software models used by engineers can be derived, composed and analysed for satisfaction of safety and timeliness properties.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملChecking Synchronous Programs Using Automatic Abstraction, Modular Veriication and Assumption Discharge
We verify synchronous programs using model checking. To cope with data and big programs, we use an automatic abstraction mechanism as well as modular veri cation. Both are proved to be conservative for the logic 8CTL . Model checking an abstract module M1 may lead to the formulation of some assumption on some module M2. Assumption are discharged using model checking or theorem proving or combin...
متن کاملA fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملAutomata | a Theory Dedicated towards Formal Circuit Synthesis
This is a technical report about a theory named Automata. Automata is an arithmetic for synchronous circuits. It provides means for representing and transforming circuit descriptions at the RT level and gate level in a mathemtical manner. Automata has been implemented in the HOL theorem proving environment. Preproven theorems are designed for performing standard synthesis steps such as state en...
متن کاملCombining Algebraic Computing and Term-Rewriting for Geometry Theorem Proving
This note reports some of our investigations on combining algebraic computing and term-rewriting techniques for automated geometry theorem proving. A general approach is proposed that requires both Clifford algebraic reduction and term-rewriting. Preliminary experiments for some concrete cases have been carried out by combining routines implemented in Maple V and Objective Caml. The experiments...
متن کامل